Automata theory - PDFSEARCH.IO - Document Search Engine

Automata theory
Results: 1263

#	Item
331	Type Synthesis for the Logical Solver: an Approach based on Query Automata Louis Jachiet, Pierre Genev`es, Nabil Laya¨ıda July 25, Add to Reading List Source URL: typex.lri.fr Language: English - Date: 2014-06-10 11:53:41 Philosophy of mind Semantics Logic Linguistics Philosophy Interpretation Model theory Philosophy of language
332	Converting regexes to Parsing Expression Grammars ´ Marcelo Oikawa1 , Roberto Ierusalimschy1 , Ana Lucia de Moura1 1 Add to Reading List Source URL: www.inf.puc-rio.br Language: English - Date: 2011-09-01 13:14:30 Computer programming Software engineering Computing Parsing Automata theory Parsing expression grammar Lookahead Syntactic predicate Perl Compatible Regular Expressions Regular expressions Pattern matching Formal languages
333	Distributed Safety Controllers for Web Services Anders Sandholm and Michael I. Schwartzbach BRICS? , Department of Computer Science University of Aarhus, Ny Munkegade DK-8000 Aarhus C, Denmark Add to Reading List Source URL: www.brics.dk Language: English - Date: 2000-03-10 07:36:26 Formal methods Computer science Finite-state machine Petri net Automata theory Models of computation Theoretical computer science
334	MathcadResonant driving of 2LS Add to Reading List Source URL: www.chemistry2011.org Language: English - Date: 2013-03-09 18:23:19 Set theory Automata theory Logic Ordinal number Probability theory Mathematics
335	Mathcad - 6.4_Disp_Harm_Osc_2 Add to Reading List Source URL: www.chemistry2011.org Language: English - Date: 2013-03-09 18:24:43 Mathematics Theoretical computer science Omega language Ω-automaton Ordinal number Automata theory Mathematical analysis
336	CS109B Notes for LectureAutomata Systems often may be modeled by a nite set of states. The system is always in one state. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:51 Formal methods Powerset construction Finite-state machine Nondeterministic finite automaton Automata theory Theoretical computer science Computer science
337	Compiler Tools in APL Robert Bernecky Snake Island Research Inc 18 Fifth Street, Ward’s Island Toronto, Ontario M5J 2B9 Canada Add to Reading List Source URL: www.snakeisland.com Language: English - Date: 2008-07-16 14:59:20 APL programming language family Array programming languages Models of computation Automata theory Functional languages Finite-state machine APL LALR parser LR parser Software engineering Computing Computer programming
338	CPMPrefix-Free Regular-Expression Matching Yo-Sub Han∗ , Yajun Wang and Derick Wood Department of Computer Science Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:23:53 Theoretical computer science Combinatorics Pattern matching Regular expression Matching Substring String Regular language Approximate string matching Formal languages Automata theory Mathematics
339	CS109B Notes for LectureNondeterministic Automata Looking for Substrings We can build an NFA to recognize a string that ends in any given substring a1a2 a if we: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:53 Combinatorics Mathematics Regular expression Regular language String Powerset construction Concatenation Finite-state machine Deterministic finite automaton Formal languages Automata theory Theoretical computer science
340	Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:23:57 Applied mathematics Nondeterministic finite automaton Regular expression Deterministic finite automaton Regular language Preorder Generalized nondeterministic finite automaton ReDoS Automata theory Theoretical computer science Computer science

UPDATE